On a problem of Oppenheim concerning “factorisatio numerorum”
نویسندگان
چکیده
منابع مشابه
On a Problem of Oppenheim concerning “ Factorisatio Numerorum ”
Letf(n) denote the number of factorizations of the natural number n into factors larger than 1 where the order of the factors does not count. We say n is " highly factorable " if f (m) <f(n) for all m < n. We prove that f (n) = n L(n)-" " " ' for n highly factorable, where L(n) = exp(log n logloglog n/loglog n). This result corrects the 1926 paper of Oppenheim where it is asserted thatf(n) = n ...
متن کاملOn the maximal order of numbers in the “factorisatio numerorum” problem
Let m(n) be the number of ordered factorizations of n ≥ 1 in factors larger than 1. We prove that for every ε > 0 m(n) < nρ exp ( (log n)1/ρ/(log log n)1+ε ) holds for all integers n > n0, while, for a constant c > 0, m(n) > nρ exp ( c(log n/ log log n)1/ρ ) holds for infinitely many positive integers n, where ρ = 1.72864 . . . is the real solution to ζ(ρ) = 2. We investigate also arithmetic pr...
متن کاملOn Some Asymptotic Formulas in the Theory of the "factorisatio Numerorum"
ON SOME ASYMPTOTIC FORMULAS IN THE THEORY OF THE "FACTORISATIO NUMERORUM" BY P. ERDÖS (Received December 2, 1940) Let 1 < a, < a2 < . . . be a sequence of integers . Denote by f (n) the number of representations of n as the product of the a's, where two representations are considered equal only if they contain the same factors in the same order . As far as I know the first papers written on the...
متن کاملOn a Problem concerning Permutation Polynomials
Let S(f) denote the set of integral ideals / such that / is a permutation polynomial modulo i", where / is a polynomial over the ring of integers of an algebraic number field. We obtain a classification for the sets S which may be written in the form S(f). Introduction. A polynomial f(x) with coefficients in a commutative ring R is said to be a permutation polynomial modulo an ideal I oi R (abb...
متن کاملOn A Problem Concerning Parameter Free Induction
8 0. Preliminaries In this note we comment on the relationships among local versions of the parameter free induction, collection and pigeonhole schemas. We start by defining the versions that will interest us. We work in the usual language of arithmetic to which a new constant symbol a has been added. P-denotes a finite set of axioms such that if M C P-, then M is the nonnegative part of a comm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 1983
ISSN: 0022-314X
DOI: 10.1016/0022-314x(83)90002-1